Lower Bounds for Monotone Real Circuit Depth and Formula Size and Tree-Like Cutting Planes
نویسنده
چکیده
Using a notion of real communication complexity recently introduced by J. Kraj cek, we prove a lower bound on the depth of monotone real circuits and the size of monotone real formulas for st-connectivity. This implies a super-polynomial speed-up of dag-like over tree-like Cutting Planes proofs.
منابع مشابه
On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems
An exponential lower bound for the size of tree-like Cutting Planes refutations of a certain family of CNF formulas with polynomial size resolution refutations is proved. This implies an exponential separation between the tree-like versions and the dag-like versions of resolution and Cutting Planes. In both cases only superpolynomial separations were known [29, 18, 8]. In order to prove these s...
متن کاملLower Bounds for Cutting Planes Proofs with Small Coe cients
We consider small-weight Cutting Planes (CP) proofs; that is, Cutting Planes (CP) proofs with coeecients up to Poly(n). We use the well known lower bounds for monotone complexity to prove an exponential lower bound for the length of CP proofs, for a family of tautologies based on the clique function. Because Resolution is a special case of small-weight CP, our method also gives a new and simple...
متن کاملMonotone Circuit Lower Bounds from Resolution
For any unsatisfiable CNF formula F that is hard to refute in the Resolution proof system, we show that a gadget-composed version of F is hard to refute in any proof system whose lines are computed by efficient communication protocols—or, equivalently, that a monotone function associated with F has large monotone circuit complexity. Our result extends to monotone real circuits, which yields new...
متن کاملExponential Separations between Restricted Resolution and Cutting Planes Proof Systems
We prove an exponential lower bound for tree-like Cutting Planes refutations of a set of clauses which has polynomial size resolution refutations. This implies an exponential separation between tree-like and dag-like proofs for both CuttingPlanes and resolution; in both cases only superpolynomial separations were known before [30, 20, 10]. In order to prove this, we extend the lower bounds on t...
متن کاملInterpolation by a Game
We introduce a notion of a real game (a generalisation of the Karchmer-Wigderson game, cf..3]) and real communication complexity, and relate them to the size of monotone real formulas and circuits. We give an exponential lower bound for tree-like monotone protocols (deened in 4, Def. 2.2]) of small real communication complexity solving the monotone communication complexity problem associated wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 4 شماره
صفحات -
تاریخ انتشار 1997